Smooth approximations of D.C. functions
Lyudmila Polyakova (Saint-Petersburg State University)
Abstract: An investigation of properties of difference of convex functions is based on the basic facts and theorems of convex analysis, as the class of convex functions is one of the most investigated among nonsmooth functions. For an arbitrary convex function a family of continuously differentiable approximations is constructed using the infimal convolution operation. If the domain of the considered function is compact then such smooth convex approximations are uniform in the Chebyshev metric. Using this technique a smooth approximation is constructed for the d.c. functions. The optimization properties of these approximations are studied.
optimization and control
Audience: researchers in the topic
Variational Analysis and Optimisation Webinar
Series comments: Register on www.mocao.org/va-webinar/ to receive information about the zoom connection.
| Organizers: | Hoa Bui*, Matthew Tam*, Minh Dao, Alex Kruger, Vera Roshchina*, Guoyin Li |
| *contact for this listing |
